Tiling a Polygon with Rectangles
نویسندگان
چکیده
We study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles). We present a linear time algorithm for deciding if a polygon can be tiled with 1 m and k 1 tiles (and giving a tiling when it exists), and a quadratic algorithm for the same problem when the tile types are m k and k m.
منابع مشابه
Tiling a Polygon with Two Kinds of Rectangles
We fix two rectangles with integer dimensions. We give a quadratic time algorithm which, given a polygon F as input, produces a tiling of F with translated copies of our rectangles (or indicates that there is no tiling). Moreover, we prove that any pair of tilings can be linked by a sequence of local transformations of tilings, called flips. This study is based on the use of J. H. Conway’s tili...
متن کاملA Note on Tiling with Integer-Sided Rectangles
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملTiling by rectangles and alternating current
This paper is on tilings of polygons by rectangles. A celebrated physical interpretation of such tilings due to R.L. Brooks, C.A.B. Smith, A.H. Stone and W.T. Tutte uses directcurrent circuits. The new approach of the paper is an application of alternating-current circuits. The following results are obtained: • a necessary condition for a rectangle to be tilable by rectangles of given shapes; •...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کامل